منابع مشابه
Comparing the tensile strength of square and reversing half-hitch alternating post knots.
BACKGROUND Square knots are the gold standard in hand-tie wound closure, but are difficult to reproduce in deep cavities, inadvertently resulting in slipknots. The reversing half-hitch alternating post (RHAP) knot has been suggested as an alternative owing to its nonslip nature and reproducibility in limited spaces. We explored whether the RHAP knot is noninferior to the square knot by assessin...
متن کاملEnhanced interaction strength for a square plasmon resonator embedded in a photonic crystal nanobeam cavity
The deployment of nanocavities may efficiently enhance the light-matter interaction for photonic components on chip. Three nanoscale cavity designs are investigated, including the one-dimensional (1-D) photonic crystal (PhC) nanobeam cavity, inline waveguide-integrated plasmon cavity, and square plasmon resonator embedded in the 1-D PhC nanobeam cavity (i.e., Combo cavity). The cavity performan...
متن کاملeffects of magnetic field direction and strength on square lid-driven cavity flow
in this study, the effects of strength and direction of the magnetic field on lid-driven cavity flow in the whole range of magnetic field strength variations, which already used in practice up to present (0 to 10 tesla), are studied. the governing equations, including conservative equations of momentum, continuity and magnetic field equations were solved numerically. momentum and continuity equ...
متن کاملRoots of Square: Cryptanalysis of Double-Layer Square and Square+
Square is a multivariate quadratic encryption scheme proposed in 2009. It is a specialization of Hidden Field Equations by using only odd characteristic elds and also X as its central map. In addition, it uses embedding to reduce the number of variables in the public key. However, the system was broken at Asiacrypt 2009 using a di erential attack. At PQCrypto 2010 Clough and Ding proposed two n...
متن کاملImproved Online Square-into-Square Packing
In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Materials
سال: 2015
ISSN: 1476-1122,1476-4660
DOI: 10.1038/nmat4381